Prevalence and structure of adding machines for cellular automata

Virtual State Machines in Cellular Automata

One of the most important properties of cellular automata is their capacity to support propagating structures. Propagating structures are employed as signals in many CA models of computation. Treating propagating structures as automata elevates the notion of a signal to something that is a computational entity in its own right . These propagating signal-automat a are embedded in th e very "tape...

Dynamic Structure Cellular Automata

Study of complex propagation phenomena is performed through cellular simulation models. Usually cellular models are specific cellular automata developed by non-computer specialists. We attempt to present here a mathematical specification of a new kind of CA. The latter allows to soundly specify cellular models using a discrete time base, avoiding basic CA limitations (infinite lattice, neighbor...

Cellular automata machines - a new environment for modeling

Exploring and Exploiting Quantum-Dot Cellular Automata

The Full Adders (FAs) constitute the essential elements of digital systems, in a sense that they affect the circuit parameters of such systems. With respect to the MOSFET restrictions, its replacement by new devices and technologies is inevitable. QCA is one of the accomplishments in nanotechnology nominated as the candidate for MOSFET replacement. In this article 4 new layouts are presente...

Prevalence of Odometers in Cellular Automata

We consider left permutive cellular automata Φ with no memory and positive anticipation, defined on the space of all doubly infinite sequences with entries from a finite alphabet. For each such automaton that is not one-to-one, there is a dense set of points x, which is large in another sense too, such that Φ : cl{Φn(x) : n ≥ 0} → cl{Φn(x) : n ≥ 0} is topologically conjugate to an odometer, the...